Incremental Learning Based on Angle Constraints
نویسندگان
چکیده
منابع مشابه
Incremental learning based on non-incremental in- duction algorithm
The machine learning algorithms can be divided into two general types: non-incremental that processes all training examples at once and incremental that handles examples one by one. This paper describes the multi-layer incremental inference algorithm (MLII) [1] based on the non-incremental inductive inference algorithm CN2 [2]. In original, the MLII algorithm used linked with the non-incrementa...
متن کاملLearning-Based Constraints on Schemata
1 In Proceedings of the Twenty-Second Annual Conference of the Cognitive Science Society, (pp. 776-81, 2000). Mahwah, NJ: Erlbaum. Abstract Schemata are frequently used in cognitive science as a descriptive framework for explaining the units of knowledge. However, the specific properties which comprise a schema are not consistent across authors. In this paper we attempt to ground the concept of...
متن کاملPedestrian Detection Based on Incremental Learning
Pedestrian detection is a hot topic in computer vision and pattern recognition. Existing pedestrian detection methods face new challenges in the background of big data, e.g., heavy burdens on computing and memory. To solve these problems, in this paper, we propose a pedestrian detection framework based on incremental learning. Compared with existing pedestrian detection frameworks, it costs muc...
متن کاملImage retrieval based on incremental subspace learning
Many problems in information processing involve some form of dimensionality reduction, such as face recognition, image/text retrieval, data visualization, etc. The typical linear dimensionality reduction algorithms include principal component analysis (PCA), random projection, locality-preserving projection (LPP), etc. These techniques are generally unsupervised which allows them to model data ...
متن کاملIncremental Phi*: Incremental Any-Angle Path Planning on Grids
We study path planning on grids with blocked and unblocked cells. Any-angle path-planning algorithms find short paths fast because they propagate information along grid edges without constraining the resulting paths to grid edges. Incremental pathplanning algorithms solve a series of similar pathplanning problems faster than repeated single-shot searches because they reuse information from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1880/1/012030